Two-Stage Hybrid Optimization Algorithm for Silicon Single Crystal Batch Scheduling Problem under Fuzzy Processing Time
نویسندگان
چکیده
Considering the widely existing processing time uncertainty in real-world production process, this paper constructs a fuzzy mathematical model for silicon single crystal batch scheduling problem to minimize maximum completion time. In paper, two-stage hybrid optimization algorithm (TSHOA) is proposed solving model. Firstly, improved differential evolution (IDE) used solve order quantity allocation of with different sizes obtain rods produced by types furnaces. Secondly, variable neighborhood search (VNS) adopted optimize sequencingof processes. Finally, simulations and comparisons demonstrate feasibility effectiveness TSHOA.
منابع مشابه
A hybrid two-stage transportation and batch scheduling problem
We study the coordinated scheduling problem of hybrid batch production on a single batching machine and two-stage transportation connecting the production, where there is a crane available in the first-stage transportation that transports jobs from the warehouse to the machine and there is a vehicle available in the second-stage transportation to deliver jobs from the machine to the customer. A...
متن کاملHybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem
This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملSingle Machine Scheduling Problem under Fuzzy Processing Time and Fuzzy Due Dates
In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2023
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2023/3816574